Weak normalization implies strong normalization in a class of non-dependent pure type systems
نویسندگان
چکیده
منابع مشابه
Inductive Data Type Systems: Strong Normalization
This paper is concerned with the foundations of Inductive Data Type Systems, an extension of pure type systems by inductive data types. IDTS generalize (inductive) types equipped with primitive recursion of higher-type, by providing de nitions of functions by pattern matching of a form which is general enough to capture recursor de nitions for strictly positive inductive types. IDTS also genera...
متن کاملThe Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especially interesting from a logical point of view. Strong normalization, an essential property for logical soundness, had only been conjectured so far: in this paper, we give a positive answer for the simply-typed system. The pro...
متن کاملA semantic method to prove strong normalization from weak normalization (draft)
1 Minimal deduction modulo 1.1 Syntax We consider a set (T) of sorts, an infinite set of variables of each sort, a set (f) of function symbols, and a set (P) of predicate symbols, that come with their rank. The formation rules for objects and propositions are the usual ones. – Variables of sort T are terms of sort T. Propositions are built-up from atomic propositions with the usual connective ⇒...
متن کاملStrong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewrite Systems, that consists of assigning intersection types to function symbols, and specifying the way in which types can be assigned to nodes and edges between nodes in the tree representation of terms. Two operations o...
متن کاملStrong Normalization with Non-Structural Subtyping
We study a type system with a notion of subtyping that involves a largest type >, a smallest type ⊥, atomic coercions between base types, and the usual ordering of function types. We prove that any λ-term typable in this system is strongly normalizing; this solves an open problem of Thatte. We also prove that the fragment without ⊥ types strictly fewer terms. This demonstrates that ⊥ adds power...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00012-3